Mendler-Style Inductive Types, Categorically
نویسندگان
چکیده
We present a basis for a category-theoretic account of Mendler-style inductive types. The account is based on suitably defined concepts of Mendler-style algebra and algebra homomorphism; Mendler-style inductive types are identified with initial Mendler-style algebras. We use the identification to obtain a reduction of conventional inductive types to Mendler-style inductive types and a reduction in the presence of certain restricted existential types of Mendler-style inductive types to conventional inductive types. CR Classification: D.1.1, D.3.3, F.3.3, F.4.1
منابع مشابه
Iteration and coiteration schemes for higher-order and nested datatypes
This article studies the implementation of inductive and coinductive constructors of higher kinds (higher-order nested datatypes) in typed term rewriting, with emphasis on the choice of the iteration and coiteration constructions to support as primitive. We propose and compare several well-behaved extensions of System Fω with some form of iteration and coiteration uniform in all kinds. In what ...
متن کاملClassical Logic with Mendler Induction - A Dual Calculus and Its Strong Normalization
We investigate (co-)induction in Classical Logic under the propositions-as-types paradigm, considering propositional, second-order, and (co-)inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-)iterator that remains strongly normalizing under head reduction. We prove this using a non-constructive realizability argument.
متن کاملIndex-Stratified Types∗
We present an index-typed core language, called Tores, that supports writing inductive proofs as total recursive programs. It allows us to reason directly by induction on index terms and by Mendler-style recursion on indexed recursive types. In addition, Tores offers stratified types that are defined by well-founded recursion on
متن کاملEfficient Mendler-Style Lambda-Encodings in Cedille
It is common to model inductive datatypes as least fixed points of functors. We show that within the Cedille type theory we can relax functoriality constraints and generically derive an induction principle for Mendler-style lambda-encoded inductive datatypes, which arise as least fixed points of covariant schemes where the morphism lifting is defined only on identities. Additionally, we impleme...
متن کاملTermination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion
Giménez’ type system for structural recursion in the Calculus of Constructions is adapted to typed functional programming. As core language, the λ-calculus with inductive types, subtyping and bounded quantification is introduced. Decorated type variables, which represent approximations of inductive types, enable the type system to track the size of arguments to recursive functions and the size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nord. J. Comput.
دوره 6 شماره
صفحات -
تاریخ انتشار 1999